Combinatorial Optimisation Notes to accompany lectures in Combinatorial Optimisation Hilary Term 2007

نویسنده

  • Colin McDiarmid
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Location and Capacity of UPFC to Improve the Operation Power System Using a Grasshopper Optimisation Algorithm

Unified Power Flow Controller (UPFC) is one of the most efficient FACTS devices that can be individually or combinatorial on all effective parameters in the transmission power of the transmission lines. With the flexibility of effective parameters in power passage, the power system operation can be improved. in this study, the optimization algorithm based on location and optimal capacity of UPF...

متن کامل

Empirically Adjusted Greedy Algorithms (EAGH): A new approach to solving combinatorial optimisation problems

A greedy heuristic to solve a given combinatorial optimisation problem can be seen as an element of an infinite set of heuristics, H, which is defined by a function that depends on several parameters. We propose a procedure for determining the best element of H for a set of instances of the combinatorial optimisation problem. The procedure consists essentially in applying a direct non-linear op...

متن کامل

Constraint Programming and Combinatorial Optimisation in Numberjack

Python benefits from a large and active programming community. Numberjack is a modelling package written in Python for embedding constraint programming and combinatorial optimisation into larger applications. It has been designed to seamlessly and efficiently support a number of underlying combinatorial solvers. Currently, Numberjack supports three constraint programming solvers, one MIP solver...

متن کامل

Incorporating Chaos into the Hopfield Neural Network for Combinatorial Optimisation

Various approaches of incorporating chaos into artificial neural networks have recently been proposed, and used successfully to solve combinatorial optimisation problems. This paper investigates three such approaches: 1) Chen & Aihara's transiently chaotic neural network with chaotic simulated annealing, which has a gradually decaying negative selfcoupling term; 2) Wang & Smith's chaotic simula...

متن کامل

CLUSTER ALGEBRAS AND CLUSTER CATEGORIES

These are notes from introductory survey lectures given at the Institute for Studies in Theoretical Physics and Mathematics (IPM), Teheran, in 2008 and 2010. We present the definition and the fundamental properties of Fomin-Zelevinsky’s cluster algebras. Then, we introduce quiver representations and show how they can be used to construct cluster variables, which are the canonical generator...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007